Broadcasting with Many Faulty Links
نویسندگان
چکیده
We study the problem of broadcasting in point-to-point networks with faulty links. The usual approach in which the number of faulty links in each step is bounded by a fixed constant does not reflect the intuition that the probability of a certain link to fail while transmitting a particular message is a fixed constant. In our model the number of faulty links in a given step depends on the total number of links used in that step. We are interested in fault-resilience of networks for broadcast in this model: in which class of networks the broadcasting time is proportional to their diameter. We show that toroidal grids of constant dimension are fault-resilient in our model, but on the other hand complete d-ary trees and cliques are not.
منابع مشابه
Optimal broadcasting in hypercubes with link faults using limited global information
We propose a fault-tolerant broadcasting algorithm for hypercubes with link faults. This algorithm is based on an extended spanning binomial tree structure that still keeps the simplicity of conventional binomial-tree-based broadcasting. In addition, it is optimal in the sense that exactly n steps are required to complete a broadcast in an n-dimensional injured hypercube with up to n 2 faulty l...
متن کاملBroadcasting in Synchronous Networks with Dynamic Faults
The problem of broadcasting in a network is to disseminate information from one node to all other nodes by transmitting it over communication links that connect nodes. We consider the time of broadcasting in the presence of at most k dynamic link failures. If a node knows source information, then in the next step all its neighbors connected by operational links also get to know it. Faults are d...
متن کاملOptimal Broadcasting in Even Tori with Dynamic Faults (Research Note)
We consider a broadcasting problem in the n-dimensional k-ary even torus in the shouting communication mode, i.e. any node of a network can inform all its neighbours in one time step. In addition, during any time step a number of links of the network can be faulty. Moreover the faults are dynamic. The problem is to determine the minimum broadcasting time if at most 2n?1 faults are allowed in an...
متن کاملReliable broadcasting
Broadcasting is a process of information dissemination in a communications network whereby a message, originated by one member, is transmitted to all members of the network. By adding some redundant calls to the broadcasting scheme, the completion of the broadcast can be guaranteed in the presence of faulty components. We investigate the implications of transmission failures on broadcasting. In...
متن کاملFast Broadcasting with Byzantine Faults
We construct and analyze a fast broadcasting algorithm working in the presence of Byzantine component faults. Such faults are particularly difficult to deal with, as faulty components may behave arbitrarily (even maliciously) as transmitters, by either blocking, rerouting, or altering transmitted messages in a way most detrimental to the broadcasting process. We assume that links and nodes of a...
متن کامل